Shortest Paths between two Points in Space for Self Managed Digital Systems
نویسندگان
چکیده
منابع مشابه
Shortest Paths between two Points in Space for Self Managed Digital Systems
Donald Hearn and M. Pauline Baker. Computer Graphics C version. Dorling Kindersley (India) Pvt. Ltd. , Licensees of Pearson Education in South Asia, 2008. Edgar A. Kraut. Fundamentals of Mathematical Physics. Dover Publications, 2007. V. Rajaraman and T. Radhakrishnan. An Introduction to Digital Computer Design. Prentice-Hall of India Private Limited New Delhi, fourth edition, June 1998. James ...
متن کاملShortest paths between shortest paths
We study the following problem on recon guring shortest paths in graphs: Given two shortest st paths, what is the minimum number of steps required to transform one into the other, where each intermediate path must also be a shortest s-t path and must di er from the previous one by only one vertex. We prove that the shortest recon guration sequence can be exponential in the size of the graph and...
متن کاملShortest Paths between Shortest Paths and Independent Sets
We study problems of reconfiguration of shortest paths in graphs. We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence has polynomial length. Moreover, we also study reconfiguration of independent sets in three different models and analyze relati...
متن کاملQuerying Two Boundary Points for Shortest Paths in a Polygonal Domain
We consider a variant of two-point Euclidean shortest path query problem: given a polygonal domain, build a data structure for two-point shortest path query, provided that query points always lie on the boundary of the domain. As a main result, we show that a logarithmic-time query for shortest paths between boundary points can be performed using Õ(n) preprocessing time and Õ(n) space where n i...
متن کاملGeneralized Unfoldings for Shortest Paths in Euclidean 3-Space
The problem of determining shortest paths in the presence of polyhedral obstacles between two points in Euclidean 3-space stems from the general problem of obtaining optimal coliision free paths in robot systems. For the special case when paths are constrained to the surfaces of 3-dimensional objects, simple planar unfoldings are used to obtain the shortest path. For the general case wben paths...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/17582-8284